Generalized rewrite theories, coherence completion, and symbolic methods

Generalized Rewrite Theories and Coherence Completion

A new notion of generalized rewrite theory suitable for symbolic reasoning and generalizing the standard notion in [3] is motivated and defined. Also, new requirements for symbolic executability of generalized rewrite theories that extend those in [8] for standard rewrite theories, including a generalized notion of coherence, are given. Finally, symbolic executability, including coherence, is b...

Generalized Rewrite Theories

Since its introduction, more than a decade ago, rewriting logic has attracted the interest of both theorists and practitioners, who have contributed in showing its generality as a semantic and logical framework and also as a programming paradigm. The experimentation conducted in these years has suggested that some significant extensions to the original definition of the logic would be very usef...

Rewrite Theories to Temporal

The work presented here aims at bridging the gap between executable speciications and formal veriication. In this paper we combine two levels of description without changing the framework. The operational level of Maude/rewriting logic and the property-oriented level of temporal logics are combined. The combination is done by an embedding. We propose a distributed temporal logic as an extension...

Probabilistic Rewrite Theories

We propose probabilistic rewrite theories as a general semantic framework supporting highlevel specification of probabilistic systems that can be massively concurrent. We give the definition and semantics of probabilistic rewrite theories and discuss the mappings between different classes of theories and models. We then define the semantics of probabilistic temporal formulae for a given probabi...

Rewrite-based Deduction and Symbolic Constraints